Systoles of 2-complexes, Reeb graph, and Grushko decomposition
نویسندگان
چکیده
منابع مشابه
A Fast Algorithm for Computing Reeb Graph of 2-Manifold
The notion of Reeb graph is part of the Morse theory which provides an analysis of the relationship between the topology and the geometrical information of a space given by a suitable function, a Morse function. Until recently, the main drawback for using Reeb graph analysis was the incapacity of constructing adequate Morse functions. Before the work of Ni et al. [2004], the used Morse function...
متن کاملReeb Graph Based Shape Retrieval for Cad
Our recent work has described a framework for matching solid of mechanical artifacts models based on scale-space feature decomposition. In this work we adopt a method of comparing solid models based on Multiresolutional Reeb Graphs (MRG) similarity computations. This method was originally proposed by Hilaga et al. in [1]. Reeb Graph technique applies MRG structure to comparisons of approximate ...
متن کاملReeb graph based examination of root development
This paper presents an approach to analyze plant root development by means of topological image analysis. For phenotyping of plants their root development, the architecture of their root systems and thereby root characteristics such as branches and branch endings are analyzed. In order to simplify the examination of root characteristics and enable an efficient comparison of roots, a representat...
متن کامل3D Mesh decomposition using Reeb graphs
Decomposition of complex 3D objects into simpler sub-parts is a challenging research subject with relevant outcomes for several application contexts. In this paper, an approach is proposed for decomposition of 3D objects based on Reeb-graphs. The approach is motivated by perceptual principles and supports identification of salient object protrusions. Experimental results are presented to demons...
متن کاملThe Reeb Graph Edit Distance is Universal
We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit distance for Reeb graphs and prove that it is stable and universal, meaning that it provides an upper bound to any other stable distance. In contrast, via a specif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2006
ISSN: 1073-7928,1687-0247
DOI: 10.1155/imrn/2006/54936